package com.cfc.stage1;

import common.TreeNode;
import org.junit.Test;

import java.util.ArrayList;
import java.util.List;

/**
 * @description: 路劲总和
 *   TODO
 *   https://leetcode.cn/problems/path-sum/description/
 * @author: yangxuan10
 * @create: 2024-04-28 14:50
 **/
public class HasPathSum {

    @Test
    public void test1() {
       hasPathSum(TreeNode.generateTree(2),10);
    }

    public void hasPathSum(TreeNode treeNode,int targetNum) {
        List<Integer> list = new ArrayList<>();
//        System.out.println(preorderTraversal(list,treeNode));
    }

    /**
     *  前序遍历
     */
    public void preorderTraversal(TreeNode treeNode) {

        while (true) {

        }


    }

}